Fourier-Motzkin elimination extension to integer programming problems
نویسندگان
چکیده
منابع مشابه
Parallel Fourier-Motzkin Elimination
Fourier{Motzkin elimination is a computationally expensive but powerful method to solve a system of linear inequalities for real and integer solution spaces. Because it yields an explicit representation of the solution set, in contrast to other methods such as Simplex, one may, in some cases, take its longer run time into account. We show in this paper that it is possible to considerably speed ...
متن کاملAdjustable Robust Optimization via Fourier-Motzkin Elimination
We demonstrate how adjustable robust optimization (ARO) problems with fixed recourse can be casted as static robust optimization problems via Fourier-Motzkin elimination (FME). Through the lens of FME, we characterize the structures of the optimal decision rules for a broad class of ARO problems. A scheme based on a blending of classical FME and a simple Linear Programming technique that can ef...
متن کاملEla Combinatorial Properties of Fourier - Motzkin Elimination
Fourier-Motzkin elimination is a classical method for solving linear inequalities in which one variable is eliminated in each iteration. This method is considered here as a matrix operation and properties of this operation are established. In particular, the focus is on situations where this matrix operation preserves combinatorial matrices (defined here as (0, 1,−1)-matrices).
متن کاملCombinatorial properties of Fourier-Motzkin elimination
Fourier-Motzkin elimination is a classical method for solving linear inequalities in which one variable is eliminated in each iteration. This method is considered here as a matrix operation and properties of this operation are established. In particular, the focus is on situations where this matrix operation preserves combinatorial matrices (defined here as (0, 1,−1)-matrices).
متن کاملScanning parameterized polyhedron using Fourier-Motzkin elimination
The paper presents two algorithms for computing a control structure whose execution enumerates the integer vectors of a parameterized polyhedron defined in a given context. Both algorithms reconsider the successive projection method, based on Fourier-Motzkin pairwise elimination, defined by Ancourt and Irigoin. The way redundant constraints are removed in their algorithm is revisited in order t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1976
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90055-8